Real-Time Locking Protocols for Clustered Scheduling∗
نویسندگان
چکیده
This paper presents the first real-time locking protocols designed specifically for clustered schedulers. Such schedulers pose challenges from a synchronization perspective because they exhibit aspects of both partitioned and global scheduling, which seem to necessitate fundamentally different means for bounding priority inversions. Both spinand suspensionbased protocols are presented. Each has asymptotically optimal blocking behavior under certain analysis assumptions.
منابع مشابه
The OMLP family of optimal multiprocessor real-time locking protocols
This paper presents the first suspsension-based multiprocessor real-time locking protocols with asymptotically optimal blocking bounds (under certain analysis assumptions). These protocols can be applied under any global, clustered, or partitioned job-level fixed-priority scheduler and support mutual exclusion, reader-writer exclusion, and k-exclusion constraints. Notably, the reader-writer and...
متن کاملScheduling and Locking in Multiprocessor Real-time Operating Systems
BJÖRN B. BRANDENBURG: Scheduling and Locking in Multiprocessor Real-Time Operating Systems (Under the direction of James H. Anderson) With the widespread adoption of multicore architectures, multiprocessors are now a standard deployment platform for (soft) real-time applications. This dissertation addresses two questions fundamental to the design of multicore-ready real-time operating systems: ...
متن کاملCombined Locking Approach for Scheduling Hard Real-Time Transactions in Real-Time Databases
Previous work has shown the superiority of the optimistic protocols over the lock-based protocols for scheduling soft or firm real-time transactions. However, optimistic protocols cannot provide schedulability analysis for hard real-time transactions because of uncertain transaction restarts. In this paper, we develop new combined locking approach for using optimistic concurrency control to sch...
متن کاملExperimental Evaluation of Real-Time Optimistic Concurrency Control Schemes
Due to its potential for a high degree of parallelism, optimistic concurrency control is expected to perform better than two-phase locking when integrated with priority-driven CPU scheduling in real-time database systems. In this paper, we examine the overall effects and the impact of the overheads involved in implementing real-time optimistic concurrency control. Using a locking mechanism to e...
متن کاملUsing Lock Servers to Scale Real-Time Locking Protocols: Chasing Ever-Increasing Core Counts∗
During the past decade, parallelism-related issues have been at the forefront of real-time systems research due to the advent of multicore technologies. In the coming years, such issues will loom ever larger due to increasing core counts. Having more cores means a greater potential exists for platform capacity loss when the available parallelism cannot be fully exploited. In this paper, such ca...
متن کامل